// ========================================================================= //

// includes
#include "stdio.h"
#include "stdlib.h"
#include "time.h"
#include "string.h"
#include "limits.h"
#include "float.h"



#define JOTAI_NUM_RANDS_ 25

const unsigned rand_primes[JOTAI_NUM_RANDS_] = {179, 103, 479, 647, 229, 37, 271, 557, 263, 607, 18743, 50359, 21929, 48757, 98179, 12907, 52937, 64579, 49957, 52567, 507163, 149939, 412157, 680861, 757751};

int next_i() {
  int counter = 0;
  return rand_primes[(++counter)%JOTAI_NUM_RANDS_];
}

float next_f() {
  int counter = 0;
  return rand_primes[(++counter)%JOTAI_NUM_RANDS_] / 757751.0F;
} 


// Usage menu
void usage() {
    printf("%s", "Usage:\n\
    prog [ARGS]\n\
\nARGS:\n\
       0            int-bounds\n\
       1            big-arr\n\
       2            big-arr-10x\n\
       3            empty\n\
\n\
");

}


// ------------------------------------------------------------------------- //

#define NULL ((void*)0)
typedef unsigned long size_t;  // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__;  // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */

/* Type definitions */
typedef  int uint8_t ;
typedef  int uint32_t ;

/* Variables and functions */

__attribute__((used)) static inline void
parse_color(unsigned int *params, unsigned int *i, unsigned int count, uint32_t *result) {
    unsigned int attr;
    uint8_t r, g, b;
    if (*i < count) {
        attr = params[(*i)++];
        switch(attr) {
            case 5:
                if (*i < count) *result = (params[(*i)++] & 0xFF) << 8 | 1;
                break;
            case 2: \
                if (*i < count - 2) {
                    /* Ignore the first parameter in a four parameter RGB */
                    /* sequence (unused color space id), see https://github.com/kovidgoyal/kitty/issues/227 */
                    if (*i < count - 3) (*i)++;
                    r = params[(*i)++] & 0xFF;
                    g = params[(*i)++] & 0xFF;
                    b = params[(*i)++] & 0xFF;
                    *result = r << 24 | g << 16 | b << 8 | 2;
                }
                break;
        }
    }
}

// ------------------------------------------------------------------------- //

int main(int argc, char *argv[]) {

    if (argc != 2) {
        usage();
        return 1;
    }

    int opt = atoi(argv[1]);
    switch(opt) {


    // int-bounds
    case 0:
    {
          // static_instructions_O0 : 12
          // dynamic_instructions_O0 : 12
          // ------------------------------- 
          // static_instructions_O1 : 7
          // dynamic_instructions_O1 : 7
          // ------------------------------- 
          // static_instructions_O2 : 7
          // dynamic_instructions_O2 : 7
          // ------------------------------- 
          // static_instructions_O3 : 7
          // dynamic_instructions_O3 : 7
          // ------------------------------- 
          // static_instructions_Ofast : 7
          // dynamic_instructions_Ofast : 7
          // ------------------------------- 
          // static_instructions_Os : 7
          // dynamic_instructions_Os : 7
          // ------------------------------- 
          // static_instructions_Oz : 7
          // dynamic_instructions_Oz : 7
          // ------------------------------- 

          unsigned int count = 100;
        
          int _len_params0 = 1;
          unsigned int * params = (unsigned int *) malloc(_len_params0*sizeof(unsigned int));
          for(int _i0 = 0; _i0 < _len_params0; _i0++) {
            params[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int _len_i0 = 1;
          unsigned int * i = (unsigned int *) malloc(_len_i0*sizeof(unsigned int));
          for(int _i0 = 0; _i0 < _len_i0; _i0++) {
            i[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int _len_result0 = 1;
          int * result = (int *) malloc(_len_result0*sizeof(int));
          for(int _i0 = 0; _i0 < _len_result0; _i0++) {
            result[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          parse_color(params,i,count,result);
          free(params);
          free(i);
          free(result);
        
        break;
    }


    // big-arr
    case 1:
    {
          // static_instructions_O0 : 12
          // dynamic_instructions_O0 : 12
          // ------------------------------- 
          // static_instructions_O1 : 7
          // dynamic_instructions_O1 : 7
          // ------------------------------- 
          // static_instructions_O2 : 7
          // dynamic_instructions_O2 : 7
          // ------------------------------- 
          // static_instructions_O3 : 7
          // dynamic_instructions_O3 : 7
          // ------------------------------- 
          // static_instructions_Ofast : 7
          // dynamic_instructions_Ofast : 7
          // ------------------------------- 
          // static_instructions_Os : 7
          // dynamic_instructions_Os : 7
          // ------------------------------- 
          // static_instructions_Oz : 7
          // dynamic_instructions_Oz : 7
          // ------------------------------- 

          unsigned int count = 255;
        
          int _len_params0 = 65025;
          unsigned int * params = (unsigned int *) malloc(_len_params0*sizeof(unsigned int));
          for(int _i0 = 0; _i0 < _len_params0; _i0++) {
            params[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int _len_i0 = 65025;
          unsigned int * i = (unsigned int *) malloc(_len_i0*sizeof(unsigned int));
          for(int _i0 = 0; _i0 < _len_i0; _i0++) {
            i[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int _len_result0 = 65025;
          int * result = (int *) malloc(_len_result0*sizeof(int));
          for(int _i0 = 0; _i0 < _len_result0; _i0++) {
            result[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          parse_color(params,i,count,result);
          free(params);
          free(i);
          free(result);
        
        break;
    }


    // big-arr-10x
    case 2:
    {
          // static_instructions_O0 : 12
          // dynamic_instructions_O0 : 12
          // ------------------------------- 
          // static_instructions_O1 : 7
          // dynamic_instructions_O1 : 7
          // ------------------------------- 
          // static_instructions_O2 : 7
          // dynamic_instructions_O2 : 7
          // ------------------------------- 
          // static_instructions_O3 : 7
          // dynamic_instructions_O3 : 7
          // ------------------------------- 
          // static_instructions_Ofast : 7
          // dynamic_instructions_Ofast : 7
          // ------------------------------- 
          // static_instructions_Os : 7
          // dynamic_instructions_Os : 7
          // ------------------------------- 
          // static_instructions_Oz : 7
          // dynamic_instructions_Oz : 7
          // ------------------------------- 

          unsigned int count = 10;
        
          int _len_params0 = 100;
          unsigned int * params = (unsigned int *) malloc(_len_params0*sizeof(unsigned int));
          for(int _i0 = 0; _i0 < _len_params0; _i0++) {
            params[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int _len_i0 = 100;
          unsigned int * i = (unsigned int *) malloc(_len_i0*sizeof(unsigned int));
          for(int _i0 = 0; _i0 < _len_i0; _i0++) {
            i[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int _len_result0 = 100;
          int * result = (int *) malloc(_len_result0*sizeof(int));
          for(int _i0 = 0; _i0 < _len_result0; _i0++) {
            result[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          parse_color(params,i,count,result);
          free(params);
          free(i);
          free(result);
        
        break;
    }


    // empty
    case 3:
    {
          // static_instructions_O0 : 12
          // dynamic_instructions_O0 : 12
          // ------------------------------- 
          // static_instructions_O1 : 7
          // dynamic_instructions_O1 : 7
          // ------------------------------- 
          // static_instructions_O2 : 7
          // dynamic_instructions_O2 : 7
          // ------------------------------- 
          // static_instructions_O3 : 7
          // dynamic_instructions_O3 : 7
          // ------------------------------- 
          // static_instructions_Ofast : 7
          // dynamic_instructions_Ofast : 7
          // ------------------------------- 
          // static_instructions_Os : 7
          // dynamic_instructions_Os : 7
          // ------------------------------- 
          // static_instructions_Oz : 7
          // dynamic_instructions_Oz : 7
          // ------------------------------- 

          unsigned int count = ((-2 * (next_i()%2)) + 1) * next_i();
        
          int _len_params0 = 1;
          unsigned int * params = (unsigned int *) malloc(_len_params0*sizeof(unsigned int));
          for(int _i0 = 0; _i0 < _len_params0; _i0++) {
            params[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int _len_i0 = 1;
          unsigned int * i = (unsigned int *) malloc(_len_i0*sizeof(unsigned int));
          for(int _i0 = 0; _i0 < _len_i0; _i0++) {
            i[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int _len_result0 = 1;
          int * result = (int *) malloc(_len_result0*sizeof(int));
          for(int _i0 = 0; _i0 < _len_result0; _i0++) {
            result[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          parse_color(params,i,count,result);
          free(params);
          free(i);
          free(result);
        
        break;
    }

    default:
        usage();
        break;

    }

    return 0;
}
